Scaling of the Clustering Function in Spatial Inhomogeneous Random Graphs

نویسندگان

چکیده

We consider an infinite spatial inhomogeneous random graph model with integrable connection kernel that interpolates nicely between existing models. Key examples are versions of the weight-dependent model, geometric graph, and age-based model. These models arise as local limit corresponding finite models, see \cite{LWC_SIRGs_2020}. For these we identify scaling \emph{local clustering} a function degree root in different regimes unified way. show exhibits phase transitions interpolation parameter moves across regimes. In addition to also leading constants clustering function. This allows us draw conclusions on geometry \emph{typical} triangle contributing

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel scaling limits for critical inhomogeneous random graphs

We find scaling limits for the sizes of the largest components at criticality for the rank-1 inhomogeneous random graphs with power-law degrees with exponent . We investigate the case where ∈ (3, 4), so that the degrees have finite variance but infinite third moment. The sizes of the largest clusters, rescaled by n−( −2)/( −1), converge to hitting times of a ‘thinned’ Lévy process. This process...

متن کامل

Inhomogeneous Random Graphs

The ‘classical’ random graphs, introduced by Erdős and Rényi half a century ago, are homogeneous in the sense that all their vertices play the same role and the degrees of the vertices tend to be concentrated around a typical value. Many graphs arising in the real world do not have this property, having, for example, power-law degree distributions. Thus there has been much recent interest in de...

متن کامل

Geometric Inhomogeneous Random Graphs

For the theoretical study of real-world networks, we propose a model of scale-free randomgraphs with underlying geometry that we call geometric inhomogeneous random graphs (GIRGs).GIRGs generalize hyperbolic random graphs, which are a popular model to test algorithms forsocial and technological networks. Our generalization overcomes some limitations of hyperbolicrandom graphs, w...

متن کامل

Susceptibility in Inhomogeneous Random Graphs

We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in practice one of its main uses is that it often gives a way of determining the critical point by solving certain linear equations. Here we relate the susceptibil...

متن کامل

Connectivity of inhomogeneous random graphs

We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c logn/n. We draw n independent points Xi from a general distribution on a separable metric space, and let their indices form the vertex set of a graph. An edge (i, j) is added with probability min(1, κ(Xi, Xj) logn/n), where κ ≥ 0 i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Physics

سال: 2023

ISSN: ['0022-4715', '1572-9613']

DOI: https://doi.org/10.1007/s10955-023-03122-6